#include <stdio.h>
#include <conio.h>
#include <math.h>
#include <algorithm>
#include <functional>
 using namespace std;

//Bai 1 CD 2017
#define vocung 400000;

int KTSCP(int n)
{
	int can = (int)sqrt((float)n);
	if(can*can==n)
	   return 1;
	return 0;	
}

// La TG Vuong khi tong binh phuong hay hieu binh phuong la so chinh phuong

int LaTGVuong(int a, int b)
{
	if(a==b)
	    return 0;
	if(KTSCP(a*a+b*b)||KTSCP(abs(a*a-b*b)))
	    return 1;
	return 0;
}

//Bai 2 CD 2017

int main2_2017()
{
	FILE *fin = fopen("DLIGHT.INP","r");
	FILE *fout = fopen("DLIGHT.OUT","w");
    int a[500000]={0},n,t,x,y;
    fscanf(fin,"%d",&n);
    fscanf(fin,"%d",&t);
    for(int i=1;i<=t;i++)
	{
		fscanf(fin,"%d",&x);
    	fscanf(fin,"%d",&y);
		for(int j=x;j<=y;j++)
			a[j]=(a[j]+1)%3;
	}
	int d=0;
	for(int i=1;i<=n;i++)
	  if(a[i]==0) d++;
	fprintf(fout,"%d",d);
	return 0;
}


//Bai 3 CD 2017

int SoBuoc(int x1, int y1, int x2, int y2)
{
	return abs(x1-x2)+abs(y1-y2);
}


int Min(int x1, int y1, int x2, int y2,int x3, int y3)
{
	int t1=SoBuoc(x1,y1,x3,y3),t2=SoBuoc(x2,y2,x3,y3);
	if(t1<t2)
	   return t1;
	return t2;
}


int MinBuoc(int x[], int y[],int n, int k)
{
	int min = 0,t;
	for(int i=k;i<n;i++)
	{
		t=0;
		for(int j=0;j<k;j++)
		    if(j==0)
			   t = SoBuoc(x[j],y[j],x[i],y[i]);
			else
			   if(t>SoBuoc(x[j],y[j],x[i],y[i]))
			       t = SoBuoc(x[j],y[j],x[i],y[i]);
	  	min = min + t;
	}
	if(k==2)
	  for(int i=0;i<n-1;i++)
		 for(int j=i+1;j<n;j++)
	     {
		    t=0;
			for(int l=0;l<n;l++)
		  		t = t+Min(x[i],y[i],x[j],y[j],x[l],y[l]);
			if(min>t)
		    	min = t;
		 }
	else
		for(int i=0;i<n;i++)
		 {
		 	t=0;
		 	for(int j=0;j<n;j++)
		 		t=t+SoBuoc(x[i],y[i],x[j],y[j]);
		 	if(min>t) min = t;
		 }  
	return min;	
}

int main3_2017()
{
	int x[]={0,0,4,4,2},y[]={0,4,0,4,2},k=2,n=5;
	printf("%d",MinBuoc(x,y,n,k));
	return 0;
}

//De 2018 bai 1 CD

int main1_2018()
{
	int a,b,c;
	int t1,t2,t3;
	t1=a*b+c;
	t2=a*c+b;
	t3=b*c+a;
	int max=t1;
	if(max<t2)
	 max=t2;
	if(max<t3)
		max=t3;
}
  //2018 bai 2 CD
int main2_2018()
{
	int a[257]={0},n,m,so;
	FILE *fin = fopen("COLFLAG.INP","r");
	FILE *fout = fopen("COLFLAG.OUT","w");
    fscanf(fin,"%d",&n);
    fscanf(fin,"%d",&m);

    for(int i=0;i<m+n;i++)
    {
       fscanf(fin,"%d",&so);
       a[so]++;    
    }
    sort(a,a+257,greater<int>());
    int i=0, co=0;
    while(co<n)
    {
    	co=co+a[i];
    	i++;
	}
	fprintf(fout,"%d",i);
    return 0;
	
}

//2018 Bai 3 CD
int TimMax(int a[][100], int m, int n, int x, int y, int u, int v, int c)
{
	int max;
	if(x==1 && y==1) max = a[1][1]-c;
	else max = a[1][1];
	for(int i=1;i<=m;i++)
		for(int j=1;j<=n;j++)
		{
			if(i>=x && i<=u && j>=y && j<=v)
			{
				int tmp = a[i][j]-c;
				if(max<tmp) max = tmp;
			}
			else if(max<a[i][j])
				max = a[i][j];
		}
	return max;    
}


int main3_2018()
{
	int a[100][100],x[100],y[100],u[100],v[100],c[100],n,m,q;
	FILE *fin = fopen("INCMAT.INP","r");
	FILE *fout = fopen("INCMAT.OUT","w");
	fscanf(fin,"%d",&m);
    fscanf(fin,"%d",&n);
    for(int i=1;i<=m;i++)
      for(int j=1;j<=n;j++)
       fscanf(fin,"%d",&a[i][j]);
    fscanf(fin,"%d",&q);
    for(int k=1;k<=q;k++)
    {
    	fscanf(fin,"%d",&x[k]);
    	fscanf(fin,"%d",&y[k]);
    	fscanf(fin,"%d",&u[k]);
    	fscanf(fin,"%d",&v[k]);
    	fscanf(fin,"%d",&c[k]);
    	for(int i=x[k];i<=u[k];i++)
           for(int j=y[k];j<=v[k];j++)
              a[i][j]+=c[k];
	}
    for(int i=1;i<=m;i++)
    {
    	for(int j=1;j<=n;j++)
    	   	printf("%d \t",a[i][j]);
    	printf("\n");
	}
	int min = TimMax(a,m,n,x[1],y[1],u[1],v[1],c[1]);
	for(int i=2;i<=q;i++)
	{
		int tmp = TimMax(a,m,n,x[i],y[i],u[i],v[i],c[i]);
		if(min>tmp)
		   min = tmp;
	}
	printf("\n\n%d",min);
    getch();
    
}